منابع مشابه
Weak Convergence of Mann Iterative Algorithm for two Nonexpansive mappings
The mann fixed point algorithm play an importmant role in the approximation of fixed points of nonexpansive operators. In this paper, by considering new conditions, we prove the weak convergence of mann fixed point algorithm, for finding a common fixed point of two nonexpansive mappings in real Hilbert spaces. This results extend the privious results given by Kanzow and Shehu. Finally, we give ...
متن کاملLocal Partitioning for Directed Graphs Using PageRank
A local partitioning algorithm finds a set with small conductance near a specified seed vertex. In this paper, we present a generalization of a local partitioning algorithm for undirected graphs to strongly connected directed graphs. In particular, we prove that by computing a personalized PageRank vector in a directed graph, starting from a single seed vertex within a set S that has conductanc...
متن کاملImproving PageRank for Local Community Detection
Community detection is a classical problem in the field of graph mining. While most algorithms work on the entire graph, it is often interesting in practice to recover only the community containing some given set of seed nodes. In this paper, we propose a novel approach to this problem, using some low-dimensional embedding of the graph based on random walks starting from the seed nodes. From th...
متن کاملThe Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence
This survey describes a general approach to a class of problems that arise in combinatorial probability and combinatorial optimization. Formally, the method is part of weak convergence theory, but in concrete problems the method has a flavor of its own. A characteristic element of the method is that it often calls for one to introduce a new, infinite, probabilistic object whose local properties...
متن کاملLocal Convergence of Newton’s Method Under a Weak Gamma Condition
We provide a local convergence analysis of Newton’s method under a weak gamma condition on a Banach space setting. It turns out that under the same computational cost and weaker hypotheses than in [4], [5], [7], we can obtain a larger radius of convergence and finer estimates on the distances involved. AMS (MOS) Subject Classification Codes: 65G99, 65B05, 47H17, 49M15.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2020
ISSN: 1050-5164
DOI: 10.1214/19-aap1494